Against stativizing negation, expletive negation and NPI-until
نویسندگان
چکیده
منابع مشابه
Expletive Negation, Negative Concord and Feature Checking*
The aim of this paper is to explore some aspects of the syntax-semantics interface representations which correspond to expletive negation (EN) and negative concord (NC). I shall postulate that a syntactic operation of logical absorption, conceived as feature checking, is needed in the theory of grammar in order to account for both phenomena. EN instantiates a nonnegative context; it will be cha...
متن کاملUNTIL, Aspect, and Negation: A Novel Argument for Two Untils
1. Outline of the argument The puzzle of English until is well-known. Karttunen 1974 argues that until is ambiguous between a durative and a punctual negative polarity (NPI) meaning. Mittwoch 1977 claims that there is no ambiguity and that the two meanings are due to scope differences: NPI-until is in fact until above negation. Mittwoch's account relies crucially on the assumption that negation...
متن کاملNegation and Double-Negation of Chinese Oppositeness
Oppositeness refers to the paradigmatic relationship of two words holding the contrast meanings. The fact that linguistic opposite differs from logical contrast has been discussed in theories, but has not been tested in practice. In this paper, we investigate three main subtypes of Chinese oppositeness, via using logical tests of negation and double-negation. Result shows that purely logical te...
متن کاملCombining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...
متن کاملNegation Without Negation in Probabilistic Logic Programming
Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Linguistica Hungarica
سال: 2011
ISSN: 1216-8076,1588-2624
DOI: 10.1556/aling.58.2011.3.1